Quantum Computation and NP-Completeness
نویسنده
چکیده
منابع مشابه
The Subset Sum Problem: Reducing Time Complexity of NP-Completeness with Quantum Search
Abstract. The Subset Sum Problem is a member of the NP-complete class, so no known polynomial time algorithm exists for it. Although there are polynomial time approximations and heuristics, these are not always acceptable, yet exact-solution algorithms are unfeasible for large input. Quantum computation offers new insights for not only the Subset Sum Problem but also the entire NP-complete clas...
متن کاملNP-complete Problems and Physical Reality
Can NP-complete problems be solved efficiently in the physical universe? I survey proposals including soap bubbles, protein folding, quantum computing, quantum advice, quantum adiabatic algorithms, quantum-mechanical nonlinearities, hidden variables, relativistic time dilation, analog computing, Malament-Hogarth spacetimes, quantum gravity, closed timelike curves, and “anthropic computing.” The...
متن کاملA New Quantum Algorithm for NP-complete Problems
An approach to the solution of NP-complete problems based on quantum computing and chaotic dynamics is proposed. We consider the satisfiability problem and argue that the problem, in principle, can be solved in polynomial time if we combine the quantum computer with the chaotic dynamics amplifier based on the logistic map. ∗To be presented at the Third International Conference on “Unconventiona...
متن کاملAdiabatic quantum optimization fails for random instances of NP-complete problems
Abstract Adiabatic quantum optimization has attracted a lot of attention because small scale simulations gave hope that it would allow to solve NP-complete problems efficiently. Later, negative results proved the existence of specifically designed hard instances where adiabatic optimization requires exponential time. In spite of this, there was still hope that this would not happen for random i...
متن کاملClassical and quantum satisfiability
Quantum computation is the paradigm of computer science wherein computations are treated as quantum physical processes. Basically, the interest on this paradigm relies on the possibility that some problems may be solved more efficiently by quantum computers than by classical ones (Cf. [2]). To analyze the relationship between the capabilities of these two very different kinds of computers, quan...
متن کامل